Left exact logic

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact Learning of Lightweight Description Logic Ontologies

We study learning of description logic TBoxes in Angluin et al.’s framework of exact learning via queries. We admit entailment queries (“is a given subsumption entailed by the target TBox?”) and equivalence queries (“is a given TBox equivalent to the target TBox?”), assuming that the signature and logic of the target TBox are known. We present three main results: (1) TBoxes formulated in DL-Lit...

متن کامل

How Large Are Left Exact Functors?

For a broad collection of categories K, including all presheaf categories, the following statement is proved to be consistent: every left exact (i.e. finite-limits preserving) functor from K to Set is small, that is, a small colimit of representables. In contrast, for the (presheaf) category K = Alg(1, 1) of unary algebras we construct a functor from Alg(1, 1) to Set which preserves finite prod...

متن کامل

A Characterization of the Left Exact Categories Whose Exact Completions Are Toposes

We characterize the categories with finite limits whose exact completions are toposes. We review the examples in the literature and also find new examples and counterexamples.

متن کامل

Exact Synthesis of Reversible Logic Circuits using Model Checking

Synthesis of reversible logic circuits has gained great attention during the last decade. Various synthesis techniques have been proposed, some generate optimal solutions (in gate count) and are termed as exact, while others are scalable in the sense that they can handle larger functions but generate sub-optimal solutions. Although scalable synthesis is very much essential for circuit design, e...

متن کامل

Exact Functional Fault Collapsing in Combinational Logic Circuits

Fault equivalence is an essential concept in digital VLSI design with significance in many different areas such as diagnosis, diagnostic ATPG, testability analysis and synthesis. In this paper, an efficient procedure to compute exact fault equivalence classes of combinational circuits is described. The procedure consists of two steps. The first step performs structural fault collapsing and uses...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1986

ISSN: 0022-4049

DOI: 10.1016/0022-4049(86)90100-3